Plan Recognition as Planning
نویسندگان
چکیده
In this work we aim to narrow the gap between plan recognition and planning by exploiting the power and generality of recent planning algorithms for recognizing the set G∗ of goals G that explain a sequence of observations given a domain theory. After providing a crisp definition of this set, we show by means of a suitable problem transformation that a goalG belongs to G∗ if there is an action sequence π that is an optimal plan for both the goalG and the goal G extended with extra goals representing the observations. Exploiting this result, we show how the set G∗ can be computed exactly and approximately by minor modifications of existing optimal and suboptimal planning algorithms, and existing polynomial heuristics. Experiments over several domains show that the suboptimal planning algorithms and the polynomial heuristics provide good approximations of the optimal goal set G∗ while scaling up as well as state-of-the-art planning algorithms and heuristics.
منابع مشابه
Toward Combining Domain Theory and Recipes in Plan Recognition
We present a technique to further narrow the gap between recipe-based and domain theory-based plan recognition through decompositional planning, a planning model that combines hierarchical reasoning as used in hierarchical task networks, and least-commitment refinement reasoning as used in partial-order causal link planning. We represent recipes through decompositional planning operators and us...
متن کاملPlan-Recognition as Planning in Continuous and Discrete Domains
Plan recognition is the task of inferring the plan of an agent, based on an incomplete sequence of its observed actions. Previous formulations of plan recognition commit early to discretizations of the environment and the observed agent’s actions. This leads to reduced recognition accuracy. To address this, we first provide a formalization of recognition problems which admits continuous environ...
متن کاملAdversarial Planning and Plan Recognition: Two Sides of the Same Coin
Effective adversarial plan recognition requires information about how the adversary is planning his actions and vice versa, the way the adversary is planning his actions is affected by how those actions are going to be detected. In this paper, we develop a game-theoretic model that integrates adversarial planning with adversarial plan recognition. The model considers planning and plan recogniti...
متن کاملMeans-End Plan Recognition - Towards a Theory of Reactive Recognition
This paper draws its inspiration from current work in reactive planning to guide plan recognition using \plans as recipes". The plan recognition process guided by such a library of plans is called means-end plan recognition. An extension of dynamic logic, called dynamic agent logic, is introduced to provide a formal semantics for means-end plan recognition and its counterpart, means-end plan ex...
متن کاملPlan Recognition as Planning Revisited
Recent work on plan recognition as planning has shown great promise in the use of a domain theory and general planning algorithms for the plan recognition problem. In this paper, we propose to extend previous work to (1) address observations over fluents, (2) better address unreliable observations (i.e., noisy or missing observations), and (3) recognize plans in addition to goals. To this end, ...
متن کاملHeuristics for Planning, Plan Recognition and Parsing
In a recent paper, we have shown that Plan Recognition over STRIPS can be formulated and solved using Classical Planning heuristics and algorithms (Ramirez and Geffner 2009). In this work, we show that this formulation subsumes the standard formulation of Plan Recognition over libraries through a compilation of libraries into STRIPS theories. The libraries correspond to AND/OR graphs that may b...
متن کامل